package com.lihepeng.leecode.frequency.tree;

/**
 *
 */
public class Solution41 {
    public int[] solve (int[] xianxu, int[] zhongxu) {
        // write code here
        return null;
    }
}
